TSTP Solution File: SET752^4 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : SET752^4 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 08:07:58 EDT 2024
% Result : Theorem 7.24s 2.43s
% Output : Refutation 7.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 84 ( 9 unt; 9 typ; 2 def)
% Number of atoms : 296 ( 119 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 619 ( 135 ~; 171 |; 19 &; 294 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 73 ( 12 ^ 42 !; 19 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(union_type,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(union_def,definition,
( union
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ) ).
thf(fun_image_type,type,
fun_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(fun_image_def,definition,
( fun_image
= ( ^ [A: $i > $i,B: $i > $o,C: $i] :
? [D: $i] :
( ( B @ D )
& ( C
= ( A @ D ) ) ) ) ) ).
thf(sk1_type,type,
sk1: $i > $o ).
thf(sk2_type,type,
sk2: $i > $o ).
thf(sk3_type,type,
sk3: $i > $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk5_type,type,
sk5: $i ).
thf(sk6_type,type,
sk6: $i ).
thf(sk7_type,type,
sk7: $i ).
thf(1,conjecture,
! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( fun_image @ C @ ( union @ A @ B ) )
= ( union @ ( fun_image @ C @ A ) @ ( fun_image @ C @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( fun_image @ C @ ( union @ A @ B ) )
= ( union @ ( fun_image @ C @ A ) @ ( fun_image @ C @ B ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $o,B: $i > $o,C: $i > $i] :
( ( ^ [D: $i] :
? [E: $i] :
( ( ( A @ E )
| ( B @ E ) )
& ( D
= ( C @ E ) ) ) )
= ( ^ [D: $i] :
( ? [E: $i] :
( ( A @ E )
& ( D
= ( C @ E ) ) )
| ? [E: $i] :
( ( B @ E )
& ( D
= ( C @ E ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i] :
? [B: $i] :
( ( ( sk1 @ B )
| ( sk2 @ B ) )
& ( A
= ( sk3 @ B ) ) ) )
!= ( ^ [A: $i] :
( ? [B: $i] :
( ( sk1 @ B )
& ( A
= ( sk3 @ B ) ) )
| ? [B: $i] :
( ( sk2 @ B )
& ( A
= ( sk3 @ B ) ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: $i] :
? [B: $i] :
( ( ( sk1 @ B )
| ( sk2 @ B ) )
& ( A
= ( sk3 @ B ) ) ) )
!= ( ^ [A: $i] :
( ? [B: $i] :
( ( sk1 @ B )
& ( A
= ( sk3 @ B ) ) )
| ? [B: $i] :
( ( sk2 @ B )
& ( A
= ( sk3 @ B ) ) ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) ) )
!= ( ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(8,plain,
( ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(24,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(22,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(29,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk7 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 ) ),
inference(lifteq,[status(thm)],[22]) ).
thf(21,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk2 @ sk7 )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(28,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 ) ),
inference(lifteq,[status(thm)],[21]) ).
thf(36,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ( ( sk3 @ sk6 )
!= ( sk3 @ sk5 ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[28]) ).
thf(38,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ( sk6 != sk5 ) ),
inference(simp,[status(thm)],[36]) ).
thf(7,plain,
( ~ ? [A: $i] :
( ( ( sk1 @ A )
| ( sk2 @ A ) )
& ( sk4
= ( sk3 @ A ) ) )
| ~ ( ? [A: $i] :
( ( sk1 @ A )
& ( sk4
= ( sk3 @ A ) ) )
| ? [A: $i] :
( ( sk2 @ A )
& ( sk4
= ( sk3 @ A ) ) ) ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ B )
| ( sk4
!= ( sk3 @ B ) )
| ~ ( sk1 @ A )
| ( sk4
!= ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ B )
| ~ ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(339,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ~ ( sk1 @ B )
| ~ ( sk1 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ B ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[18]) ).
thf(340,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ A )
| ~ ( sk1 @ A ) ),
inference(pattern_uni,[status(thm)],[339:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(346,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk1 @ A ) ),
inference(simp,[status(thm)],[340]) ).
thf(360,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ( sk6 != sk5 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[38,346]) ).
thf(361,plain,
( ( sk2 @ sk7 )
| ( sk6 != sk5 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[360:[bind(A,$thf( sk5 ))]]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ~ ( sk2 @ B )
| ( sk4
!= ( sk3 @ B ) )
| ~ ( sk2 @ A )
| ( sk4
!= ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A ) ),
inference(simp,[status(thm)],[13]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ B )
!= sk4 )
| ~ ( sk2 @ B )
| ~ ( sk2 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ B ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[14]) ).
thf(48,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ A )
| ~ ( sk2 @ A ) ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( A )),bind(B,$thf( A ))]]) ).
thf(49,plain,
! [A: $i] :
( ( ( sk3 @ A )
!= sk4 )
| ~ ( sk2 @ A ) ),
inference(simp,[status(thm)],[48]) ).
thf(52,plain,
! [A: $i] :
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk6 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[28,49]) ).
thf(53,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[52:[bind(A,$thf( sk6 ))]]) ).
thf(67,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ( sk6 != sk5 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[38,49]) ).
thf(68,plain,
( ( sk2 @ sk7 )
| ( sk6 != sk5 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[67:[bind(A,$thf( sk5 ))]]) ).
thf(76,plain,
! [A: $i] :
( ( sk6 != sk5 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[68,49]) ).
thf(77,plain,
( ( sk6 != sk5 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( sk7 ))]]) ).
thf(26,plain,
( ( sk4
= ( sk3 @ sk6 ) )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(32,plain,
( ( ( sk3 @ sk6 )
= sk4 )
| ( sk2 @ sk7 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(lifteq,[status(thm)],[26]) ).
thf(20,plain,
( ( sk1 @ sk6 )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(27,plain,
( ( ( sk3 @ sk7 )
= sk4 )
| ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(lifteq,[status(thm)],[20]) ).
thf(25,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(31,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ( sk2 @ sk7 ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(364,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[31,346]) ).
thf(365,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[364:[bind(A,$thf( sk5 ))]]) ).
thf(19,plain,
( ( sk1 @ sk6 )
| ( sk4
= ( sk3 @ sk7 ) )
| ( sk4
= ( sk3 @ sk5 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(30,plain,
( ( ( sk3 @ sk7 )
= sk4 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(185,plain,
! [A: $i] :
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk7 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[30,49]) ).
thf(186,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 ) ),
inference(pattern_uni,[status(thm)],[185:[bind(A,$thf( sk7 ))]]) ).
thf(354,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[186,346]) ).
thf(355,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[354:[bind(A,$thf( sk5 ))]]) ).
thf(531,plain,
( ( sk1 @ sk6 )
| ~ ( sk1 @ sk5 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[365,355]) ).
thf(532,plain,
( ( sk1 @ sk6 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[531:[]]) ).
thf(556,plain,
! [A: $i] :
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[532,346]) ).
thf(557,plain,
( ~ ( sk1 @ sk5 )
| ( ( sk3 @ sk6 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[556:[bind(A,$thf( sk6 ))]]) ).
thf(86,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ~ ( sk2 @ sk6 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[53,49]) ).
thf(87,plain,
( ( sk2 @ sk7 )
| ~ ( sk2 @ sk6 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[86:[bind(A,$thf( sk5 ))]]) ).
thf(200,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk5 )
= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[24,186]) ).
thf(201,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( ( sk3 @ sk5 )
= sk4 ) ),
inference(pattern_uni,[status(thm)],[200:[]]) ).
thf(197,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ( ( sk3 @ sk7 )
!= ( sk3 @ sk5 ) )
| ( sk4 != sk4 ) ),
inference(eqfactor_ordered,[status(thm)],[30]) ).
thf(199,plain,
( ( ( sk3 @ sk5 )
= sk4 )
| ( sk1 @ sk6 )
| ( sk7 != sk5 ) ),
inference(simp,[status(thm)],[197]) ).
thf(350,plain,
! [A: $i] :
( ( sk2 @ sk7 )
| ~ ( sk2 @ sk6 )
| ~ ( sk1 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[53,346]) ).
thf(351,plain,
( ( sk2 @ sk7 )
| ~ ( sk2 @ sk6 )
| ~ ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[350:[bind(A,$thf( sk5 ))]]) ).
thf(369,plain,
! [A: $i] :
( ~ ( sk2 @ sk6 )
| ~ ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[351,49]) ).
thf(370,plain,
( ~ ( sk2 @ sk6 )
| ~ ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[369:[bind(A,$thf( sk7 ))]]) ).
thf(106,plain,
! [A: $i] :
( ~ ( sk2 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[87,49]) ).
thf(107,plain,
( ~ ( sk2 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[106:[bind(A,$thf( sk7 ))]]) ).
thf(54,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[31,49]) ).
thf(55,plain,
( ( sk1 @ sk6 )
| ( sk2 @ sk7 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( sk5 ))]]) ).
thf(207,plain,
! [A: $i] :
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk2 @ A )
| ( ( sk3 @ sk5 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[186,49]) ).
thf(208,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk7 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[207:[bind(A,$thf( sk5 ))]]) ).
thf(241,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ sk7 ) ) ),
inference(paramod_ordered,[status(thm)],[55,208]) ).
thf(242,plain,
( ( sk1 @ sk6 )
| ~ ( sk2 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[241:[]]) ).
thf(463,plain,
! [A: $i] :
( ( sk6 != sk5 )
| ~ ( sk1 @ sk5 )
| ( ( sk3 @ A )
!= sk4 )
| ( ( sk2 @ sk7 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[361,49]) ).
thf(464,plain,
( ( sk6 != sk5 )
| ~ ( sk1 @ sk5 )
| ( ( sk3 @ sk7 )
!= sk4 ) ),
inference(pattern_uni,[status(thm)],[463:[bind(A,$thf( sk7 ))]]) ).
thf(746,plain,
$false,
inference(e,[status(thm)],[5,24,29,361,53,77,32,27,49,3,557,87,346,30,6,201,28,38,199,370,31,351,186,107,242,532,464,68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET752^4 : TPTP v8.1.2. Released v3.6.0.
% 0.03/0.13 % Command : run_Leo-III %s %d
% 0.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 6 13:22:39 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.80/0.78 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.17/0.94 % [INFO] Parsing done (158ms).
% 1.17/0.95 % [INFO] Running in sequential loop mode.
% 1.58/1.16 % [INFO] eprover registered as external prover.
% 1.58/1.16 % [INFO] cvc4 registered as external prover.
% 1.58/1.16 % [INFO] Scanning for conjecture ...
% 1.76/1.24 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.82/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.82/1.26 % [INFO] Problem is higher-order (TPTP THF).
% 1.82/1.26 % [INFO] Type checking passed.
% 1.82/1.26 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 7.24/2.43 % External prover 'e' found a proof!
% 7.24/2.43 % [INFO] Killing All external provers ...
% 7.24/2.43 % Time passed: 1972ms (effective reasoning time: 1480ms)
% 7.24/2.43 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 7.24/2.43 % Axioms used in derivation (0):
% 7.24/2.43 % No. of inferences in proof: 73
% 7.24/2.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1972 ms resp. 1480 ms w/o parsing
% 7.24/2.47 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.24/2.47 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------